Fault Hamiltonicity of Meshes with Two Wraparound Edges
نویسندگان
چکیده
We consider the fault hamiltonian properties of m×n meshes with two wraparound edges in the first row and the last row, denoted by M2(m, n), m ≥ 2, n ≥ 3. M2(m, n) is a spanning subgraph of Pm × Cn which has interesting fault hamiltonian properties. We show that M2(m, n) with odd n is hamiltonian-connected and 1-fault hamiltonian. For even n, M2(m, n), which is bipartite, with a single faulty element is shown to be 1-fault strongly hamiltonian-laceable. In previous works[1, 2], it was shown that Pm×Cn also has these hamiltonian properties. Our result shows that two additional wraparound edges are sufficient for an m × n mesh to have such properties rather than m wraparound edges. As an application of fault-hamiltonicity of M2(m, n), we show that the n-dimensional hypercube is strongly hamiltonian laceable if there are at most n− 2 faulty elements and at most one faulty vertex.
منابع مشابه
Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults
The locally twisted cube is a variation of hypercube, which possesses some properties superior to the hypercube. In this paper, we investigate the edge-faulttolerant hamiltonicity of an n-dimensional locally twisted cube, denoted by LTQn. We show that for any LTQn (n ≥ 3) with at most 2n− 5 faulty edges in which each node is incident to at least two fault-free edges, there exists a fault-free H...
متن کاملFault-Hamiltonicity of Product Graph of Path and Cycle
We investigate hamiltonian properties of Pm × Cn, m ≥ 2 and even n ≥ 4, which is bipartite, in the presence of faulty vertices and/or edges. We show that Pm×Cn with n even is strongly hamiltonianlaceable if the number of faulty elements is one or less. When the number of faulty elements is two, it has a fault-free cycle of length at least mn−2 unless both faulty elements are contained in the sa...
متن کاملOn the Fault Tolerance and Hamiltonicity of the Optical Transpose Interconnection System of Non-Hamiltonian Base Graphs
Hamiltonicity is an important property in parallel and distributed computation. Existence of Hamiltonian cycle allows efficient emulation of distributed algorithms on a network wherever such algorithm exists for linear-array and ring, and can ensure deadlock freedom in some routing algorithms in hierarchical interconnection networks. Hamiltonicity can also be used for construction of independen...
متن کاملHoneycomb Networks: Topological Properties and Communication Algorithms
The honeycomb mesh, based on hexagonal plane tessellation, is considered as a multiprocessor interconnection network. A honeycomb mesh network with n nodes has degree 3 and diameter a 1.63 n 1, which is 25 percent smaller degree and 18.5 percent smaller diameter than the mesh-connected computer with approximately the same number of nodes. Vertex and edge symmetric honeycomb torus network is obt...
متن کاملProof that Enhanced Pyramid Networks are 2-Edge-Hamiltonicity
The pyramid network is a hierarchy structure based on meshes. Chen et al. in 2004 proposed a new hierarchy structure, called the enhanced pyramid network, by replacing each mesh at layer greater than one of the pyramid network with a torus. This investigation demonstrates that the enhanced pyramid network with two faulty edges is Hamiltonian. The result is optimal because both edge connectivity...
متن کامل